Search
Search Results for "Approximating Maximum Matching Requires Almost Quadratic Time"
STOC24 3 D 1 Approximating Maximum Matching Requires Almost Quadratic Time
Approximating Maximum Matching Requires Almost Quadratic Time
STOC 2023 - Session 1B - Sublinear Time Algorithms and Complexity of Approximate Maximum Matching.
Aviad Rubinstein (Stanford University) Approximate maximum matching, SETH, obfuscation, and you
Sariel Har-Peled: Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs
Pankaj Agarwal:Deterministic, Near-Linear ε-Approximation Algorithm for Geometric Bipartite Matching
Soheil Behnezhad - Recent Progress on Sublinear Time Algorithms for Maximum Matching
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs... - Jonathan Kelner
A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
Matthias Poloczek: New Approximation Algorithms for MAX SAT Simple, Fast, and Excellent in Practice
W7L33_Vertex Cover via Maximal Matchings
Almost linear time algorithms for max-flow and more (Sushant Sachdeva)